Errata: Reactor Criticality and Nonnegative Matrices

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nonnegative Matrices

For a loopless, acyclic, transitive directed graph S, we study the relations between the predecessor property and the well structured property on S. These properties assure the existence of nonnegativ€ Jordan bases for any nonnegative matrix with singular graph S.

متن کامل

Monotonicity of Nonnegative Matrices

We present a nonnegative rank factorization of a nonnegative matrix A for the case in which one or both of A(1)A and AA(1) are nonnegative. This gives, in particular, a known result for characterizing nonnegative matrices when A†A or AA† is nonnegative. We applied this characterization to the derivation of known results based on the characterization of nonnegative monotone matrices. A matrix A ...

متن کامل

Which Nonnegative Matrices Are Slack Matrices?

In this paper we characterize the slack matrices of cones and polytopes among all nonnegative matrices. This leads to an algorithm for deciding whether a given matrix is a slack matrix. The underlying decision problem is equivalent to the polyhedral verification problem whose complexity is unknown.

متن کامل

Nonnegative Ranks, Decompositions, and Factorizations of Nonnegative Matrices

The nonnegative rank of a nonnegative matrix is the smallest number of nonnegative rank-one matrices into which the matrix can be decomposed additively. Such decompositions are useful in diverse scientific disciplines. We obtain characterizations and bounds and show that the nonnegative rank can be computed exactly over the reals by a finite algorithm.

متن کامل

Spectral Properties of Reducible Nonnegative and Eventually Nonnegative Matrices

Let η = (η1, η2, . . . , ηt) and ν = (ν1, ν2, . . . , νt) be two sequences of nonnegative integers. (Append zeros if necessary to the end of the shorter sequence so that they are the same length.) We say that ν is majorized by η if ∑j l=1 νl ≤ ∑j l=1 ηl for all 1 ≤ j ≤ t and tl=1 νl = ∑t l=1 ηl. We write ν 1 η. Let Γ = (V,E) be a graph where V is a finite vertex set and E ⊆ V ×V is an edge set....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Society for Industrial and Applied Mathematics

سال: 1959

ISSN: 0368-4245,2168-3484

DOI: 10.1137/0107028